A Short Note on Two-Variable Logic with a Linear Order Successor and a Preorder Successor
نویسندگان
چکیده
The finite satisfiability problem of two-variable logic extended by a linear order successor and a preorder successor is shown to be undecidable. The decidability of the finite satisfiability problem of two-variable logic extended by orders and preorders as well as their corresponding successor relations has been currently investigated by several papers [2, 5, 3]. This short note extends [3] which is work under submission. In the setting of [3] only two cases remained open. One of them, namely the extension of two-variable logic by one successor relation of a linear order and one successor relation of a preorder, is settled here. We refer to [2] and [5] for more background and motivation. In the rest of this note we first introduce the necessary notation and then prove that the finite satisfiability problem of the extension of two-variable logic by one successor relation of a linear order and one successor relation of a preorder is undecidable.
منابع مشابه
Two-Variable Logic with Two Order Relations
The finite satisfiability problem for two-variable logic over structures with unary relations and two order relations is investigated. Firstly, decidability is shown for structures with one total preorder relation and one linear order relation. More specifically, we show that this problem is complete for EXPSPACE. As a consequence, the same upper bound applies to the case of two linear orders. ...
متن کاملSatisfiability for two-variable logic with two successor relations on finite linear orders
We study the finite satisfiability problem for first order logic with two variables and two binary relations, corresponding to the induced successor relations of two finite linear orders. We show that the problem is decidable in NExpTime.
متن کاملTwo-Variable Logic on 2-Dimensional Structures
This paper continues the study of the two-variable fragment of first-order logic (FO2) over twodimensional structures, more precisely structures with two orders, their induced successor relations and arbitrarily many unary relations. Our main focus is on ordered data words which are finite sequences from the set Σ×D where Σ is a finite alphabet and D is an ordered domain. These are naturally re...
متن کاملTwo-variable Logic with Counting and a Linear Order
We study the finite satisfiability problem for the two-variable fragment of first-order logic extended with counting quantifiers (C) and interpreted over linearly ordered structures. We show that the problem is undecidable in the case of two linear orders (in the presence of two other binary symbols). In the case of one linear order it is NExpTime-complete, even in the presence of the successor...
متن کاملSuccessor-invariant first-order logic on finite structures
We consider successor-invariant first-order logic (FO+ succ)inv, consisting of sentences Φ involving an “auxiliary” binary relation S such that (A, S1) |= Φ ⇐⇒ (A, S2) |= Φ for all finite structures A and successor relations S1, S2 on A. A successorinvariant sentence Φ has a well-defined semantics on finite structures A with no given successor relation: one simply evaluates Φ on (A, S) for an a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1306.3418 شماره
صفحات -
تاریخ انتشار 2013